\( \newcommand{\water}{{\rm H_{2}O}} \newcommand{\R}{\mathbb{R}} \newcommand{\N}{\mathbb{N}} \newcommand{\Z}{\mathbb{Z}} \newcommand{\Q}{\mathbb{Q}} \newcommand{\E}{\mathbb{E}} \newcommand{\d}{\mathop{}\!\mathrm{d}} \newcommand{\grad}{\nabla} \newcommand{\T}{^\text{T}} \newcommand{\mathbbone}{\unicode{x1D7D9}} \renewcommand{\:}{\enspace} \DeclareMathOperator*{\argmax}{arg\,max} \DeclareMathOperator*{\argmin}{arg\,min} \DeclareMathOperator{\Tr}{Tr} \newcommand{\norm}[1]{\lVert #1\rVert} \newcommand{\KL}[2]{ \text{KL}\left(\left.\rule{0pt}{10pt} #1 \; \right\| \; #2 \right) } \newcommand{\slashfrac}[2]{\left.#1\middle/#2\right.} \)

Sigma algebra vs powerset: Both are sets of subsets

Both a sigma algebra and the powerset are sets of subsets. However:

NOTE Since the powerset is the set of all subsets, and a sigma algebra is a set of subsets, it follows that \(\; \Sigma \subseteq 2^S \;\). Note the possible equality: in fact, the powerset is a sigma algebra! This is because it contains all subsets, so it contains both the full set and the empty set, as well as the unions of all subsets, thus fulfilling all the conditions of a sigma algebra.